Cardinal Neighbor Quadtree: a New Quadtree-based Structure for Constant-Time Neighbor Finding
نویسندگان
چکیده
منابع مشابه
Anisotropic k-Nearest Neighbor Search Using Covariance Quadtree
We present a variant of the hyper-quadtree that divides a multidimensional space according to the hyperplanes associated to the principal components of the data in each hyperquadrant. Each of the 2 hyper-quadrants is a data partition in a λ-dimension subspace, whose intrinsic dimensionality λ ≤ d is reduced from the root dimensionality d by the principal components analysis, which discards the ...
متن کاملConstant-Time Neighbor Finding in Hierarchical Tetrahedral Meshes
Techniques are presented for moving between adjacent tetrahedra in a tetrahedral mesh. The tetrahedra result from a recursive decomposition of a cube into six initial congruent tetrahedra. A new technique is presented fo r labeling the triangular faces. The labeling enables the implementation of a binary-like decomposition of each tetrahedron which is represented using a pointerless representat...
متن کاملA New Quadtree-based Terrain LOD Algorithm
Terrain LOD algorithm is a dynamic and local dough sheet subduction algorithm. On the basis of the research on traditional quadtree algorithm, this paper proposed a new terrain LOD algorithm using quadtree. On deviation computing standard, besides static deviation and view distance, motion vector and observation vector are introduced, which made the result of deviation computing close to the ac...
متن کاملA New Method for Quadtree Triangulation
The aim of the study is to increase the accuracy of a terrain triangulation while maintaining or reducing the number of triangles. To this end, a new non-trivial algorithm for quadtree triangulation is proposed. The proposed algorithm includes: i) a resolution parameters calculation technique and ii) three error metric calculation techniques. Simulation software is also devised to apply the pro...
متن کاملNeighbor Finding Techniques for
Image representation plays an important role in image processing applications. Recently there has been a considerable interest in the use of quadtrees. This has led to the development of algorithms for performing image processing tasks as well as for performing converting between the quadtree and other representations. Common to these algorithms is a traversal of the tree and the performance of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015907501